A Dynamic Merge-or-Split Learning Algorithm on Gaussian Mixture for Automated Model Selection
نویسندگان
چکیده
Gaussian mixture modelling is a powerful tool for data analysis. However, the selection of number of Gaussians in the mixture, i.e., the mixture model or scale selection, remains a difficult problem. In this paper, we propose a new kind of dynamic merge-or-split learning (DMOSL) algorithm on Gaussian mixture such that the number of Gaussians can be determined automatically with a dynamic merge-or-split operation among estimated Gaussians from the EM algorithm. It is demonstrated by the simulation experiments that the DMOSL algorithm can automatically determine the number of Gaussians in a sample data set, and also lead to a good estimation of the parameters in the original mixture. Moreover, the DMOSL algorithm is applied to the classification of Iris
منابع مشابه
Novel Radial Basis Function Neural Networks based on Probabilistic Evolutionary and Gaussian Mixture Model for Satellites Optimum Selection
In this study, two novel learning algorithms have been applied on Radial Basis Function Neural Network (RBFNN) to approximate the functions with high non-linear order. The Probabilistic Evolutionary (PE) and Gaussian Mixture Model (GMM) techniques are proposed to significantly minimize the error functions. The main idea is concerning the various strategies to optimize the procedure of Gradient ...
متن کاملNegative Selection Based Data Classification with Flexible Boundaries
One of the most important artificial immune algorithms is negative selection algorithm, which is an anomaly detection and pattern recognition technique; however, recent research has shown the successful application of this algorithm in data classification. Most of the negative selection methods consider deterministic boundaries to distinguish between self and non-self-spaces. In this paper, two...
متن کاملSpoken Language Identification for Indian Languages Using Split and Merge EM Algorithm
Performance of Language Identification (LID) System using Gaussian Mixture Models (GMM) is limited by the convergence of Expectation Maximization (EM) algorithm to local maxima. In this paper an LID system is described using Gaussian Mixture Models for the extracted features which are then trained using Split and Merge Expectation Maximization Algorithm that improves the global convergence of E...
متن کاملSplit and Merge EM Algorithm for Improving Gaussian Mixture Density Estimates
The EM algorithm for Gaussian mixture models often gets caught in local maxima of the likelihood which involve having too many Gaussians in one part of the space and too few in another, widely separated part of the space. We present a new EM algorithm which performs split and merge operations on the Gaussians to escape from these configurations. This algorithm uses two novel criteria for effici...
متن کاملA fast fixed-point BYY harmony learning algorithm on Gaussian mixture with automated model selection
The Bayesian Ying–Yang (BYY) harmony learning theory has brought about a new mechanism that model selection on Gaussian mixture can be made automatically during parameter learning via maximization of a harmony function on finite mixture defined through a specific bidirectional architecture (BI-architecture) of the BYY learning system. In this paper, we propose a fast fixed-point learning algori...
متن کامل